Generalized Measures of Edge Fault Tolerance in -star Graphs
نویسندگان
چکیده
This paper considers a kind of generalized measure of fault tolerance in the -star graph for and , and determines , which implies that at least edges of have to remove to get a disconnected graph that contains no vertices of degree less than . This result shows that the -star graph is robust when it is used to model the topological structure of a large-scale parallel processing system.
منابع مشابه
Restricted connectivity for three families of interconnection networks
Vertex connectivity and edge connectivity are two important parameters in interconnection networks. Even though they reflect the fault tolerance correctly, they undervalue the resilience of large networks. By the concept of conditional connectivity and super-connectivity, the concept of restricted vertex connectivity and restricted edge connectivity of graphs was proposed by Esfahanian [A.H. Es...
متن کاملGeneralized Measures of Fault Tolerance in (n, k)-star Graphs
This paper considers a kind of generalized measure κ (h) s of fault tolerance in the (n, k)-star graph Sn,k and determines κ (h) s (Sn,k) = n+h(k−2)−1 for 2 6 k 6 n−1 and 0 6 h 6 n − k, which implies that at least n + h(k − 2) − 1 vertices of Sn,k have to remove to get a disconnected graph that contains no vertices of degree less than h. This result contains some known results such as Yang et a...
متن کامل(n-3)-edge-fault-tolerant Weak-pancyclicity of (n, K)-star Graphs
The (n, k)-star graph is a generalized version of the n-star graph, which belongs to the class of Cayley graphs, and has been recognized as an attractive alternative to an n-cube for building massively parallel computers. Recently, Chen et al. showed that an (n, k)-star graph is 6-weak-vertex-pancyclic for k < n–1, that is, each vertex of an (n, k)-star graph is contained in a cycle of length r...
متن کاملEdge-bipancyclicity of star graphs under edge-fault tolerant
The star graph Sn is one of the most famous interconnection networks. It has been shown by Li [T.-K. Li, Cycle embedding in star graphs with edge faults, Appl. Math. Comput. 167 (2005) 891–900] that Sn contains a cycle of length from 6 to n! when the number of fault edges in the graph does not exceed n 3. In this paper, we improve this result by showing that for any edge subset F of Sn with jFj...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کامل